Strongly-MDS convolutional codes
نویسندگان
چکیده
منابع مشابه
The Existence of Strongly-MDS Convolutional Codes
It is known that maximum distance separable and maximum distance profile convolutional codes exist over large enough finite fields of any characteristic for all parameters (n, k, δ). It has been conjectured that the same is true for convolutional codes that are strongly maximum distance separable. Using methods from linear systems theory, we resolve this conjecture by showing that, over a large...
متن کاملConstructing strongly-MDS convolutional codes with maximum distance profile
This paper revisits strongly-MDS convolutional codes with maximum distance profile (MDP). These are (non-binary) convolutional codes that have an optimum sequence of column distances and attains the generalized Singleton bound at the earliest possible time frame. These properties make these convolutional codes applicable over the erasure channel, since they are able to correct a large number of...
متن کاملConstruction and Decoding of Strongly MDS Convolutional Codes
A new class of of rate 1/2 convolutional codes called strongly MDS convolutional codes are introduced and studied. These are codes having optimal column distances. Properties of these codes are given and a concrete construction is provided. This construction has the ability to correct δ errors in any sliding window of length 4δ + 2 whereas the best known MDS block code with parameters [n, n/2],...
متن کاملConstructions of MDS-convolutional codes
Maximum-distance separable (MDS) convolutional codes are characterized through the property that the free distance attains the generalized singleton bound. The existence of MDS convolutional codes was established by two of the authors by using methods from algebraic geometry. This correspondence provides an elementary construction of MDS convolutional codes for each rate k/n and each degree δ. ...
متن کاملOn Negacyclic MDS-Convolutional Codes
New families of classical and quantum optimal negacyclic convolutional codes are constructed in this paper. This optimality is in the sense that they attain the classical (quantum) generalized Singleton bound. The constructions presented in this paper are performed algebraically and not by computational search.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2006
ISSN: 0018-9448
DOI: 10.1109/tit.2005.862100